Efficient scheduling of tasks without full use of processor resources
نویسندگان
چکیده
منابع مشابه
Energy Efficient Real Time Scheduling of Dependent Tasks Sharing Resources
In the design of embedded systems, it is very important to reduce energy consumption and thus prolong battery life in everywhere existed battery-powered embedded systems. Dynamic voltage scaling (DVS) processors, which support many operating voltages and speeds, can efficiently reduce energy consumption by making appropriate decisions on the processor speed/voltage during the scheduling of real...
متن کاملScheduling Tasks of a Parallel Program in Two-Processor Systems with Use of Cellular Automata
Cellular automata (CA) are proposed to design scheduling algorithms for allocating tasks of a parallel program in multiprocessor systems. For this purpose a program graph is considered as CA which control a process of migration of tasks in a multiprocessor system. In the rst phase of the algorithm, e ective rules for CA are discovered by a genetic algorithm. In the second phase, for any initial...
متن کاملScheduling with Contingent Resources and Tasks
Finding optimal schedules for the most commonly considered classes of scheduling problems is NP-complete. Best algorithms scale up to very large scheduling problems when optimality is not required and good solution quality suffices. These problems have perfect information in the sense that the resource availability, set of tasks, task duration, and other important facts, are fully known at the ...
متن کاملScheduling periodic Tasks on Multiple Periodic Resources
In this paper, we study the problem of scheduling periodic tasks on multiple periodic resources. We take two step approach by first integrating multiple periodic resources to an equivalent single periodic resource so that existing real-time scheduling theorems on single periodic resource can be applied. Second, we extend the schedulability tests of periodic tasks on a single periodic resource i...
متن کاملComplexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations
We investigate the computational complexity of scheduling multiprocessor tasks with pres-pecified processor allocations. We consider two criteria: minimizing schedule length and minimizing the sum of the task completion times. In addition, we investigate the complexity of problems when precedence constraints or release dates are involved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1980
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90002-x